Joint Source-Channel Turbo Techniques for Discrete-Valued Sources: From Theory to Practice
نویسندگان
چکیده
The principles which have been prevailing so far for designing communication systems rely on Shannon’s source and channel coding separation theorem [1]. This theorem states that source and channel optimum performance bounds can be approached as close as desired by designing independently the source and channel coding strategies. However, this theorem holds only under asymptotic conditions, where both codes are allowed infinite length and complexity. If the design of the system is constrained in terms of delay and complexity, if the sources are not stationary, or if the channels are non-ergodic, separate design and optimization of the source and channel coders can be largely suboptimal. For practical systems, joint source-channel (de)coding may reduce the end-to-end distortion. It is one of the aspects covered by the term cross-layer design, meaning a re-thinking of the layer separation principle. This article focuses on recent developments of joint source-channel turbo coding and decoding techniques, which are described in the framework of normal factor graphs. The scope is restricted to lossless compression and discrete-valued sources. The presented techniques can be applied to the quantized values of a lossy source codec but the quantizer itself and its impact are not considered.
منابع مشابه
Joint Source-Channel Turbo Decoding of Entropy Coded Sources
A new turbo joint source-channel decoding algorithm is presented. The proposed scheme, derived from a Bayesian network representation of the coding chain, incorporates three types of information: the source memory; the residual redundancy of the source coder; and finally the redundancy introduced by the channel coder. Specifically, we modify an existing algorithm by introducing an equivalent gr...
متن کاملGuest editorial - the turbo principle: from theory to practice II
INTRODUCTION I N 1997, Hagenauer coined the phrase " the turbo principle " to describe the fundamental strategy underlying the success of turbo decoding, namely the iterated exchange of soft information between different blocks in a communications receiver in order to improve overall system performance. This principle, embodied in the iterative decoding of parallel concatenated " turbo codes " ...
متن کاملReduced Complexity Joint Source-channel Turbo Decoding of Entropy Coded Sources
In [6], we presented a new joint source channel turbo decoding algorithm for entropy coded sources. The algorithm was based on a Bayesian network representation of the coding chain, and incorporates three types of redundancies, namely the source memory, the residual redundancy of the source coder and the artificial redundancy introduced by the channel coder. The algorithm was shown to yield sev...
متن کاملJoint Source-Channel Decoding of Variable-Length Codes with Soft Information: A Survey
Multimedia transmission over time-varying wireless channels presents a number of challenges beyond existing capabilities conceived so far for third-generation networks. Efficient quality-of-service (QoS) provisioning for multimedia on these channels may in particular require a loosening and a rethinking of the layer separation principle. In that context, joint source-channel decoding (JSCD) str...
متن کاملTurbo Decoding of Hidden Markov
We describe techniques for joint source-channel coding of hidden Markov sources using a modiied turbo decoding algorithm. This avoids the need to perform any explicit source coding prior to transmission, and instead allows the decoder to utilize the a priori structure due to the hidden Markov source. In addition, we present methods that allow the decoder to estimate the parameters of the Markov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the IEEE
دوره 95 شماره
صفحات -
تاریخ انتشار 2007